Steiner almost self-complementary graphs and halving near-Steiner triple systems
نویسندگان
چکیده
We show that for every admissible order v ≡ 0 or 2 (mod 6) there exists a near-Steiner triple system of order v that can be halved. As a corollary we obtain that a Steiner almost self-complementary graph with n vertices exists if and only if n ≡ 0 or 2 (mod 6). © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Hamilton Decompositions of Block-Intersection Graphs of Steiner Triple Systems
Block-intersection graphs of Steiner triple systems are considered. We prove that the block-intersection graphs of non-isomorphic Steiner triple systems are themselves non-isomorphic. We also prove that each Steiner triple system of order at most 15 has a Hamilton decomposable block-intersection graph.
متن کاملThe Steiner diameter of a graph
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $Ssubseteq V(G)$, the Steiner distance $d(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $...
متن کاملSteiner Triple Systems without Parallel Classes
A Steiner triple system of order v (or STS(v)) is a pair (V,B) such that V is a v-set and B is a set of 3-subsets of V (called triples) such that each pair of elements of V occurs in exactly one triple in B. Such a system exists if and only if v ≡ 1 or 3 (mod 6). A parallel class of an STS(6k + 3) is a set of 2k + 1 disjoint triples in the system, and an almost parallel class of an STS(6k + 1) ...
متن کاملOn Cliques in Spanning Graphs of Projective Steiner Triple Systems
We are interested in what sizes of cliques are to be found in any arbitrary spanning graph of a Steiner triple system S. In this paper we investigate spanning graphs of projective Steiner triple systems, proving, not surprisingly, that for any positive integer k and any sufficiently large projective Steiner triple system S, every spanning graph of S contains a clique of size k.
متن کاملBlock-Intersection Graphs of Steiner Triple Systems
A Steiner triple system of order n is a collection of subsets of size three, taken from the n-element set {0, 1, ..., n−1}, such that every pair is contained in exactly one of the subsets. The subsets are called triples, and a block-intersection graph is constructed by having each triple correspond to a vertex. If two triples have a non-empty intersection, an edge is inserted between their vert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009